Multi-level feature filtering algorithm based on MapReduce
نویسندگان
چکیده
منابع مشابه
An Improved Morphological Algorithm for Filtering Airborne LiDAR Point Cloud Based on Multi-Level Kriging Interpolation
Filtering is one of the core post-processing steps for airborne LiDAR point cloud. In recent years, the morphology-based filtering algorithms have proven to be a powerful and efficient tool for filtering airborne LiDAR point cloud. However, most traditional morphology-based algorithms have difficulties in preserving abrupt terrain features, especially when using larger filtering windows. In ord...
متن کاملScalable Multi-agent Simulation Based on MapReduce
Jason is perhaps the most advanced multi-agent programming language based on AgentSpeak . Unfortunately, its current Java-based implementation does not scale up and is seriously limited for simulating systems of hundreds of thousands of agents. We are presenting a scalable simulation platform for running huge numbers of agents in a Jason style simulation framework. Our idea is (1) to identify i...
متن کاملImplementations of Dijkstra's Algorithm Based on Multi-level Buckets
A 2-level bucket data structure has been shown to perform well in a Dijkstra's algorithm implementation 4, 5]. In this paper we study how the implementation performance depends on the number of bucket levels used. In particular we are interested in the best number of levels to use in practice.
متن کاملMOEICA: Enhanced multi-objective optimization based on imperialist competitive algorithm
In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...
متن کاملPDTSSE: A Scalable Parallel Decision Tree Algorithm Based on MapReduce
Parallel decision tree learning is an effective and efficient approach to scaling the decision tree to large data mining application. Aiming at large scale decision tree learning, we present a novel parallel decision tree learning algorithm in MapReduce framework, called PDTSSE (Parallel Decision Tree via Sampling Splitting points with Estimation). We first propose an estimation method for samp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2020
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1486/3/032027